THE SpEnt METHOD FOR LOSSY SOURCE CODING †

نویسندگان

  • Jerry D. Gibson
  • Mark G. Kokes
چکیده

At present, the most successful methods for lossy source compression are sample-function adaptive coders. Prominent examples of these techniques are the still image compression methods utilizing wavelet expansions and tree structures, such as the zero-tree method or the SPIHT algorithm, and variable rate speech coders that allocate bits to parameters within a frame based upon the classification of the current frame. All of these techniques can be classified as non-linear approximation methods. In this work, we use Campbell’s coefficient rate, and the spectral entropy of the source random process, as a guide to formulate a new non-linear approximation method to lossy source compression. We call this new approach, the spectral entropy (SpEnt) method, and we develop and report on the promise of SpEnt based coders for the lossy compression of still images and wideband speech (50 Hz to 7 kHz).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Title of the Paper (18pt Times New Roman, Bold)

Vector quantization is known as the best lossy source coding among the fixed-to-fixed coding methods because of its satisfactory ability of expression. Although it can represent any fixed-to-fixed code and has optimization methods that guarantee local optimality, its encoding and optimization require the computation that grows exponential to the data length. We propose an optimization method fo...

متن کامل

Lossless Source Coding Lecture Notes & Examples

variously referred to as source coding, lossless coding, noiseless coding or entropy coding exactly and without error, the original message. Lossless coding implies that the message may be decoded back to the original sequence of symbols. The converse of lossless coding (“lossy” coding) implies some degree of approximation of the original message. lossless coding may augment lossy coding, eg VQ...

متن کامل

Lossy Source Coding - Information Theory, IEEE Transactions on

Lossy coding of speech, high-quality audio, still images, and video is commonplace today. However, in 1948, few lossy compression systems were in service. Shannon introduced and developed the theory of source coding with a fidelity criterion, also called rate-distortion theory. For the first 25 years of its existence, rate-distortion theory had relatively little impact on the methods and system...

متن کامل

Analogy and duality between random channel coding and lossy source coding

Here we write in a unified fashion (using “R(P,Q,D)” [1]) the random coding exponents in channel coding and lossy source coding. We derive their explicit forms and show, that, for a given random codebook distribution Q, the channel decoding error exponent can be viewed as an encoding success exponent in lossy source coding, and the channel correct-decoding exponent can be viewed as an encoding ...

متن کامل

On Lossless Quantum Data Compression and Quan- tum Variable–Length Codes

In Shannon’s Foundation of Information Theory ([27]) perhaps the most basic contributions are Source Coding Theorems (lossy and lossless) and the Channel Coding Theorem. In the most natural and simple source model DMS the source outputs a sequence X1, X2, . . . of independent, identically distributed random variables taking finitely many values. The Lossy Source Coding Theorem says that this se...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000